In irp algorithm , routing is based on component from server , which is simple and practical , but cannot adapt dynamic change in distributed system environment Irp算法僅根據(jù)服務器提供的路徑構件進行尋徑,簡單實用,但難以適應分布系統(tǒng)環(huán)境的動態(tài)變化。
In l - s algorithm ( link state algorithm ) , routing is based on table drove , which can adapt dynamic change of distributed system environment and guarantee message routing correctly L - s算法(即鏈路狀態(tài)算法)采用表驅動的方式進行消息尋徑,能夠自主適應分布系統(tǒng)環(huán)境的動態(tài)變化,保障消息的正確尋徑。